Timely Distributed Computation With Stragglers
نویسندگان
چکیده
منابع مشابه
Gradient Coding: Avoiding Stragglers in Distributed Learning
We propose a novel coding theoretic framework for mitigating stragglers in distributed learning. We show how carefully replicating data blocks and coding across gradients can provide tolerance to failures and stragglers for synchronous Gradient Descent. We implement our schemes in python (using MPI) to run on Amazon EC2, and show how we compare against baseline approaches in running time and ge...
متن کاملDistributed Symbolic Computation with DTS
We describe the design and implementation of the Distributed Threads System (DTS), a programming environment for the paralleliza-tion of irregular and highly data-dependent algorithms. DTS extends the support for fork/join parallel programming from shared memory threads to a distributed memory environment. It is currently implemented on top of PVM, adding an asynchronous RPC abstraction and tur...
متن کاملDistributed Scientific Computation With JavaSpaces?
Java-based tuplespa es provide a new avenue of exploration for distributed omputing with ommodity te hnology. This paper presents early results from our investigation of JavaSpa es for s ienti omputation. We dis uss weaknesses as revealed by our attempts to map existing parallel algorithms to the JavaSpa es model, and use low-level metri s to argue that several lasses of problems are not eÆ ien...
متن کاملHummer: Mitigating Stragglers with Partial Clones
Small jobs typically run for interactive data analyses in datacenters, and often are delayed by long-running tasks called stragglers. Many efforts, like Blacklist, speculative execution, proactive mitigation, have been devoted to the solutions. However, they either consume too much time or waste too many resources. In this paper, we propose a new proactive method to mitigate stragglers by perfo...
متن کاملFully distributed PageRank computation with exponential convergence
This work studies a fully distributed algorithm for computing the PageRank vector, which is inspired by the Matching Pursuit and features: 1) fully distributed 2) expected converges with exponential rate 3) low storage requirement (two scalar values per page). Illustrative experiments are conducted to verify the findings. I. PROBLEM STATEMENT PageRank vector was proposed by the founders of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2020
ISSN: 0090-6778,1558-0857
DOI: 10.1109/tcomm.2020.3001873